Diagonalisation of Hamiltonian

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Householder - QL Matrix Diagonalisation

In this paper we report an eeective parallelisation of the House-holder routine for the reduction of a real symmetric matrix to tri-diagonal form and the QL algorithm for the diagonalisation of the resulting matrix. The Householder algorithm scales like N 3 =P + N 2 log 2 (P) and the QL algorithm like N 2 + N 3 =P as the number of processors P is increased for xed problem size. The constant par...

متن کامل

Block-diagonalisation of Matrices and Operators

In this short note we deal with a constructive scheme to decompose a continuous family of matrices A(ρ) asymptotically as ρ → 0 into blocks corresponding to groups of eigenvalues of the limit matrix A(0). We also discuss the extension of the scheme to matrix families depending upon additional parameters and operators on Hilbert spaces. 1. Matrix theory 1.1. Preliminaries. We first recall some w...

متن کامل

On Joint Diagonalisation for Dynamic Network Analysis

Joint diagonalisation (JD) is a technique used to estimate an average eigenspace of a set of matrices. Whilst it has been used successfully in many areas to track the evolution of systems via their eigenvectors; its application in network analysis is novel. The key focus in this paper is the use of JD on matrices of spanning trees of a network. This is especially useful in the case of real-worl...

متن کامل

Geometric-Arithmetic Index of Hamiltonian Fullerenes

A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.

متن کامل

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress of Theoretical Physics

سال: 1954

ISSN: 0033-068X

DOI: 10.1143/ptp.12.102